On recognizable and rational formal power series
نویسندگان
چکیده
We will describe the recognizable formal power series over arbitrary semirings and in partially commuting variables, i.e. over trace monoids. We prove that the recognizable series are certain rational power series, which can be constructed from the polynomials by using the operations sum, product and a restricted star which is applied only to series for which the elements in the support all have the same connected alphabet. The converse is true if the underlying semi-ring is commutative. Moreover, if in addition the semiring is idempotent then the same result holds with a star restricted to series for which the elements in the support have connected (possibly di erent) alphabets. It is shown that these assumptions over the semiring are necessary. This provides a joint generalization of Kleene's, Schutzenberger's and Ochma nski's theorems.
منابع مشابه
HYPERTRANSCENDENTAL FORMAL POWER SERIES OVER FIELDS OF POSITIVE CHARACTERISTIC
Let $K$ be a field of characteristic$p>0$, $K[[x]]$, the ring of formal power series over $ K$,$K((x))$, the quotient field of $ K[[x]]$, and $ K(x)$ the fieldof rational functions over $K$. We shall give somecharacterizations of an algebraic function $fin K((x))$ over $K$.Let $L$ be a field of characteristic zero. The power series $finL[[x]]$ is called differentially algebraic, if it satisfies...
متن کاملOn Recognizable and Rational Formal Power Series in Partially Commuting Variables
We will describe the recognizable formal power series over arbitrary semirings and in partially commuting variables, i.e. over trace monoids. We prove that the recognizable series are certain rational power series, which can be constructed from the polynomials by using the operations sum, product and a restricted star which is applied only to series for which the elements in the support all hav...
متن کاملRational Transformations of Formal Power Series
Formal power series are an extension of formal languages. Recognizable formal power series can be captured by the so-called weighted finite automata, generalizing finite state machines. In this paper, motivated by codings of formal languages, we introduce and investigate two types of transformations for formal power series. We characterize when these transformations preserve rationality, genera...
متن کاملParikh's Theorem Does Not Hold for Multiplicities
We consider the question of whether the famous Parikh's theorem holds with multiplicities i.e., for formal power series instead of languages. We introduce two families of semilinear formal power series over a commutative product monoid. The strict hierarchy of algebraic, rational, recognizable and semi-linear formal power series is proved and in this way it is established that the Parikh's theo...
متن کاملSome results about numeration systems on a regular language : Formal power series and Multiplication by a constant in the polynomial case
Generalizations of numeration systems in which N is recognizable by finite automata are obtained by describing a lexicographically ordered infinite regular language. For these systems of numeration, we obtain a characterization of the recognizable sets of integers in terms of rational formal series. We also show that, for a numeration system constructed on a regular language of density in Θ(n),...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2013